基于体布拉格光栅的波束合成技术研究及实现

探讨实现激光波束合成的新方法,分析体布拉格光栅作为激光波束引导器的可行性,基于Kogelnik耦合波理论,着重讨论了影响体布拉格光栅衍射效率的波长选择性和角度选择性因素。实验上给出布拉格光栅的具体制作过程,利用透射式体布拉格光栅完成了2束不同波长的激光并束、2束同种波长的激光并束实验,验证了利用布拉格光栅进行并束的可行性。为了实际中应用的方便,提出在晶体内部利用90°配置设计特定角度的布拉格光栅,让激光垂直照射晶体表面,即可满足布拉格角度入射,改良并束光路,简化理论计算,提高并束效率。     

稀疏贝叶斯学习框架下的扩展目标雷达关联成像

传统的关联成像方法未考虑复杂扩展目标的结构信息,在高分辨成像时的应用受到限制,为此提出一种自适应结构配对稀疏贝叶斯学习方法。该方法在稀疏贝叶斯学习的框架内针对扩展目标建立一种结构配对层次化高斯先验模型,然后采用变分贝叶斯期望-最大化算法交替进行目标重构和参数优化。该方法将某一信号分量的重构与周围信号分量联系起来,并能在迭代过程中自适应地调整表征各信号分量相关性的参数。实验结果表明,该方法针对扩展目标可以有效地进行高分辨成像。     

时间跨度对GPS坐标序列噪声模型及速度估计影响分析

选取全球范围内72个基准站的坐标序列,采用改进的赤池信息量准则、贝叶斯信息量准则对不同噪声模型组合进行噪声分析,得到基准站坐标序列的最优噪声模型及速度参数,探讨时间序列跨度对噪声模型及速度估计的影响。结果表明,基准站坐标序列噪声模型不能由单一的噪声模型表述,其呈现出多样性特征,主要表现为幂律噪声、高斯马尔科夫噪声、闪烁噪声+白噪声特征,且三坐标分量表现出不同的噪声特性;随着时间跨度的增加,坐标时间序列的最优噪声模型、GPS站速度及其不确定度逐渐由发散趋于收敛,随机游走噪声模型的比重有所增加。结果表明10 a以上的时间跨度是较为理想的噪声模型估计尺度。     

基于不可信证据源与冲突重分配的证据合成方法

针对D-S证据理论在高冲突下失效的问题,在比较修正原始证据源和重新分配冲突两种方法的基础上,提出一种新的合成规则,新方法用可信度修正证据的同时,把全局冲突分为两部分,并依据"全局冲突在全局分配、局部冲突在局部分配"的原则对冲突进行细化分配。通过仿真分析,并与其他方法比较,新的合成方法能更好地融合冲突证据,收敛速度快,具有较强的抗干扰能力。     

FORECASTING SERIES CONTAINING OFFSETTING BREAKS: OLD SCHOOL AND NEW SCHOOL METHODS OF FORECASTING TRANSNATIONAL TERRORISM

Transnational terrorism data are difficult to forecast because they contain an unknown number of structural breaks of unknown functional form. The rise of religious fundamentalism, the demise of the Soviet Union, and the rise of al Qaeda have changed the nature of transnational terrorism. ‘Old School’ forecasting methods simply smooth or difference the data. ‘New School’ methods use estimated break dates to control for regime shifts when forecasting. We compare the various forecasting methods using a Monte Carlo study with data containing different types of breaks. The study's results are used to forecast various types of transnational terrorist incidents.     

Bayesian selling problem with partial information

We introduce an optimal stopping problem for selling an asset when the fixed but unknown distribution of successive offers is from one of n possible distributions. The initial probabilities as to which is the true distribution are given and updated in a Bayesian manner as the successive offers are observed. After receiving an offer, the seller has to decide whether to accept the offer or continue to observe the next offer. Each time an offer is observed a fixed cost is incurred. We consider both the cases where recalling a past offer is allowed and where it is not allowed. For each case, a dynamic programming model and some heuristic policies are presented. Using simulation, the performances of the heuristic methods are evaluated and upper bounds on the optimal expected return are obtained. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

On the effectiveness of top‐down strategy for forecasting autoregressive demands

We investigate the relative effectiveness of top‐down versus bottom‐up strategies for forecasting the demand of an item that belongs to a product family. The demand for each item in the family is assumed to follow a first‐order univariate autoregressive process. Under the top‐down strategy, the aggregate demand is forecasted by using the historical data of the family demand. The demand forecast for the items is then derived by proportional allocation of the aggregate forecast. Under the bottom‐up strategy, the demand forecast for each item is directly obtained by using the historical demand data of the particular item. In both strategies, the forecasting technique used is exponential smoothing. We analytically evaluate the condition under which one forecasting strategy is preferred over the other when the lag‐1 autocorrelation of the demand time series for all the items is identical. We show that when the lag‐1 autocorrelation is smaller than or equal to 1/3, the maximum difference in the performance of the two forecasting strategies is only 1%. However, if the lag‐1 autocorrelation of the demand for at least one of the items is greater than 1/3, then the bottom‐up strategy consistently outperforms the top‐down strategy, irrespective of the items' proportion in the family and the coefficient of correlation between the item demands. A simulation study reveals that the analytical findings hold even when the lag‐1 autocorrelation of the demand processes is not identical. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

机动目标跟踪的非线性算法

卡尔曼滤波器对线性高斯滤波问题能提供最优解, 而对目标运动模型、观测方程等要求的非线性就不再适合,提出了一种机动目标自适应非线性粒子滤波算法-" 粒子滤波器"(Particle Filters PF)法, 这种方法不受线性化误差和高斯噪声假定的限制,适用于任何状态转换或测量模型, 分析比较了粒子滤波(PF)与扩展卡尔曼滤波算法(EKF) 的滤波精度、运算量等方面指标.给出了基于典型非线性模型的算法仿真, 仿真结果表明粒子滤波新方法优于EKF对机动目标跟踪.     

Asymmetric information and third-party intervention in civil wars

I study a two-period model of conflict with two combatants and a third party who is an ally of one of the combatants. The third party is fully informed about the type of her ally but not about the type of her ally’s enemy. In a signaling game, I find that if the third party is unable to give a sufficiently high assistance to her ally, then there exists a unique separating equilibrium in which the third party’s expected intervention causes her ally’s enemy to exert more effort than in the absence of third-party intervention; this worsens the conflict.     

基于重构相空间AD-SVM的短期电力负荷预测

利用重庆市九龙坡区电网2009年7月1日000-10月8日4：00 99 d共2 380个历史电力负荷数据,分析其特点和规律.将构建混沌理论的平均位移（AD）法和支持向量机（SVM）相结合,提出了一种新的短期电力负荷预测模型.通过仿真计算,将结果与神经网络法预测结果进行对比,可得新方法能较好反应数据变化趋势,并且具备较好的拟合能力,能够提高负荷预测精度.在实际短期电力负荷预测中,可优先选用平均位移法与支持向量机相结合的新方法.